Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
441	Using Relevance Queries for Identification of Read-Once Functions Add to Reading List Source URL: www.mpi-sws.org Language: English - Date: 2013-02-16 12:55:16 Computational complexity theory Decision tree model Function FO Quantum algorithm Theoretical computer science Mathematics Applied mathematics
442	05391 Abstracts Collection Algebraic and Numerical Algorithms and Computer-assisted Proofs Dagstuhl Seminar 1 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2006-01-31 09:29:16 Computer algebra Complexity classes Numerical analysis Algorithm Mathematical logic Polynomial Gröbner basis Computational complexity theory NP Theoretical computer science Applied mathematics Mathematics
443	Algorithms Lecture 4: Efficient Exponential-Time Algorithms [Fa’14] Wouldn’t the sentence “I want to put a hyphen between the words Fish and And and And and Chips in my Fish-And-Chips sign.” have been clearer if Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:02:22 NP-complete problems Analysis of algorithms Graph coloring Graph theory Time complexity Boolean satisfiability problem Randomized algorithm MAXEkSAT One-in-three 3SAT Theoretical computer science Computational complexity theory Mathematics
444	Energy-Aware Service Allocation Damien Borgettoa , Henri Casanovab , Georges Da Costaa , Jean-Marc Piersona b a IRIT, University of Toulouse, Toulouse, France Department of Information and Computer Sciences University of Add to Reading List Source URL: navet.ics.hawaii.edu Language: English - Date: 2012-06-26 08:38:20 Operations research Computational complexity theory Convex optimization Linear programming Greedy algorithm Algorithm Reduction Bin packing problem Theoretical computer science Mathematics Applied mathematics
445	Algorithms Lecture 28: Lower Bounds [Fa’13] It was a Game called Yes and No, where Scrooge’s nephew had to think of something, and the rest must find out what; he only answering to their questions yes or no, as the Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:15 Analysis of algorithms Sorting algorithms Computational complexity theory Time complexity Decision tree model Binary search algorithm Algorithm Randomized algorithm Quicksort Theoretical computer science Mathematics Applied mathematics
446	PDF Document Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-07-05 10:27:28 Constraint programming Relational model Conjunctive query Database theory SQL Matching FO Relational algebra Decomposition method Theoretical computer science Computing Computational complexity theory
447	Retraction of Probabilistic Computation and Linear Time Lance Fortnow Michael Sipser MIT Math Dept. Cambridge, MA 02139 Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2010-05-13 09:33:41 Structural complexity theory Complexity classes Models of computation Lance Fortnow Probabilistic complexity theory Interactive proof system IP Bounded-error probabilistic polynomial Probabilistic Turing machine Theoretical computer science Computational complexity theory Applied mathematics
448	Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem∗ Manindra Agrawal† Department of Computer Science Indian Institute of Technology Kanpur Add to Reading List Source URL: www.cse.iitk.ac.in Language: English - Date: 2006-11-19 23:12:18 Complexity classes Circuit complexity Computability theory Mathematical optimization FO NP-complete P versus NP problem Time complexity Reduction Theoretical computer science Computational complexity theory Applied mathematics
449	Recent progress on point-counting algorithms David Harvey University of New South Wales 1st October 2013, University of Sydney Add to Reading List Source URL: web.maths.unsw.edu.au Language: English - Date: 2013-10-04 02:06:12 Algebraic curves Group theory Analytic number theory Field theory Polynomial Computational complexity theory Elliptic curve Hyperelliptic curve Prime number Abstract algebra Mathematics Algebra
450	Flexible Resource Allocation for Optical Networks Dmitriy Katz1 , Baruch Schieber1 , and Hadas Shachnai2? 1 IBM T.J. Watson Research Center, Yorktown Heights, NY 10598. Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-04-27 19:14:38 Operations research Computational complexity theory Approximation algorithms Complexity classes Mathematical optimization Polynomial-time approximation scheme Dynamic programming Linear programming Algorithm Theoretical computer science Applied mathematics Mathematics

UPDATE